New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers
نویسندگان
چکیده
منابع مشابه
The cutting stock problem and excessive accumulation of usable leftovers
Many methods exist for solving the one-dimensional cutting stock optimization problem with usable leftovers (CSPUL), but none of them consider the excessive generation of usable leftovers (UL) in stock after several consecutiveorders. To highlight this problem, the COLA method for solving the CSPUL [1] was selected. We performed experiments that showed how UL in stock continuously grow when the...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملTwo-stage two-dimensional guillotine cutting problems with usable leftovers∗
In this study we are concerned with the non-exact two-stage two-dimensional guillotine cutting problem considering usable leftovers, in which stock plates remainders of the cutting patterns (non-used material or trim loss) can be used in the future, if they are large enough to fulfill future demands of items (ordered smaller plates). This cutting problem can be characterized as a residual bin-p...
متن کاملA Local Search Approach for One Dimensional Cutting Stock Problem
One dimensional cutting stock problem (1D-CSP) is one of the representative combinatorial optimization problems, which has many applications in, e.g., steel, paper and fiber industries. To define an instance of 1D-CSP, we are given sufficient number of stock rolls which have the same length L, and m types of products with given lengths (l1, l2, . . . , lm) and demands (d1, d2, . . . , dm). A cu...
متن کاملA combined approach for solution of general one-dimensional cutting stock problem
In this article, a combined method for the solution of the General one-Dimensional Cutting Stock Problem (G1D-CSP) is proposed. The main characteristic of G1D-CSP is that all stock lengths can be different. The new approach combines two existing methods: Sequential Heuristic Procedure, and branch-and-bound. The algorithm based on the proposed method leads to almost optimal solutions, which are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2017
ISSN: 0160-5682,1476-9360
DOI: 10.1057/s41274-016-0098-y